Random trees and general branching processes
نویسندگان
چکیده
منابع مشابه
Random trees and general branching processes
We consider a tree that grows randomly in time. Each time a new vertex appears, it chooses exactly one of the existing vertices and attaches to it. The probability that the new vertex chooses vertex x is proportional to w(deg(x)), a weight function of the actual degree of x. The weight function w : N → R+ is the parameter of the model. In [4] and [11] the authors derive the asymptotic degree di...
متن کاملGeneral branching processes in discrete time as random trees
The simple Galton–Watson process describes populations where individuals live one season and are then replaced by a random number of children. It can also be viewed as a way of generating random trees, each vertex being an individual of the family tree. This viewpoint has led to new insights and a revival of classical theory. We show how a similar reinterpretation can shed new light on the more...
متن کاملBranching random walks and contact processes on Galton-Watson trees
We consider branching random walks and contact processes on infinite, connected, locally finite graphs whose reproduction and infectivity rates across edges are inversely proportional to vertex degree. We show that when the ambient graph is a Galton-Watson tree then, in certain circumstances, the branching random walks and contact processes will have weak survival phases. We also provide bounds...
متن کاملBranching Processes, and Random-cluster Measures on Trees
Random-cluster measures on infinite regular trees are studied in conjunction with a general type of ‘boundary condition’, namely an equivalence relation on the set of infinite paths of the tree. The uniqueness and non-uniqueness of randomcluster measures are explored for certain classes of equivalence relations. In proving uniqueness, the following problem concerning branching processes is enco...
متن کاملThe height of random k-trees and related branching processes
We consider the height of random k-trees and k-Apollonian networks. These random graphs are not really trees, but instead have a tree-like structure. The height will be the maximum distance of a vertex from the root. We show that w.h.p. the height of random k-trees and k-Apollonian networks is asymptotic to c log t, where t is the number of vertices, and c = c(k) is given as the solution to a t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Random Structures and Algorithms
سال: 2007
ISSN: 1042-9832,1098-2418
DOI: 10.1002/rsa.20137